Reliable Estimation of Minimum Embedding Dimension Through Statistical Analysis of Nearest Neighbors
نویسندگان
چکیده
منابع مشابه
Nearest neighbors and correlation dimension for dimensionality estimation. Application to factor analysis of real biological time series data
Determining the number of components in dimensionality reduction techniques is still one of the open problems of research on data analysis. These methods are often used in knowledge extraction of multivariate great dimensional data, but very often the number of components is assumed to be known. One of the classical methods to estimate this dimensionality is based on the Principal Components An...
متن کاملEnsemble Estimation of Distributional Functionals via $k$-Nearest Neighbors
The problem of accurate nonparametric estimation of distributional functionals (integral functionals of one or more probability distributions) has received recent interest due to their wide applicability in signal processing, information theory, machine learning, and statistics. In particular, k-nearest neighbor (nn) based methods have received a lot of attention due to their adaptive nature an...
متن کاملBoosting Nearest Neighbors for the Efficient Estimation of Posteriors
It is an admitted fact that mainstream boosting algorithms like AdaBoost do not perform well to estimate class conditional probabilities. In this paper, we analyze, in the light of this problem, a recent algorithm, unn, which leverages nearest neighbors while minimizing a convex loss. Our contribution is threefold. First, we show that there exists a subclass of surrogate losses, elsewhere calle...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولNearest-neighbors medians clustering
We propose a nonparametric cluster algorithm based on local medians. Each observation is substituted by its local median and this new observation moves toward the peaks and away from the valleys of the distribution. The process is repeated until each observation converges to a fixpoint. We obtain a partition of the sample based on the convergence points. Our algorithm determines the number of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Nonlinear Dynamics
سال: 2017
ISSN: 1555-1415,1555-1423
DOI: 10.1115/1.4036814